A near-quadratic algorithm for the alpha-connected two-center decision problem
نویسندگان
چکیده
We consider the problem of deciding if a set of points can be covered by two discs with centers p and q and common radius r such that the ratio d(p; q)=r is bounded below by a user supplied constant. We also present an O(n 2 log 2 n) algorithm for this problem.
منابع مشابه
Optimal Operation Management of Grid-connected Microgrid Using Multi-Objective Group Search Optimization Algorithm
Utilizing distributed generations (DGs) near load points has introduced the concept of microgrid. However, stochastic nature of wind and solar power generation as well as electricity load makes it necessary to utilize an energy management system (EMS) to manage hourly power of microgrid and optimally supply the demand. As a result, this paper utilizes demand response program (DRP) and battery t...
متن کاملA Near-Quadratic Algorithm for the Alpha-Connected Two-Center Problem
PO-HSUEH HUANG, YIN-TE TSAI AND CHUAN-YI TANG Department of Computer Science and Information Engineering Tamkang University Taipei, 251 Taiwan E-mail: [email protected] Department of Computer Science and Communication Engineering Providence University Taichung, 433 Taiwan E-mail: [email protected] Department of Computer Science National Tsing Hua University Hsinchu 300, Taiwan E-mail: cytang@c...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملAn Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...
متن کاملApplying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002